Method and apparatus for content-based packet routing using compact filter storage and off-line pre-computation

ABSTRACT

A method and apparatus provide for content-based routing of packets in a publish-subscribe network. A packet is received via the network. A map specifying computed filter coverage in an attribute space is accessed. Content of the packet is inspected for a routing decision for the packet. The map is used for the routing decision for the packet. The packet is routed based upon the inspected content of the packet and the map. A router for content-based routing of packets in a publish-subscribe network, comprising modules for performing this method is provided. A network including a plurality of such routers is provided. A computer-readable medium including instructions for performing this method is provided.

REFERENCE TO RELATED APPLICATIONS

The present application incorporates by reference and claims the priority of U.S. Provisional Application No. 60/368,831, entitled “Practical Method for Content-Based Packet Routing in a Publish/Subscribe Network,” filed Mar. 28, 2002, and U.S. Provisional Application No. 60/447,782, entitled “Propagating Content Filters, Content-Based Packet Routing Using Compact Filter Storage and Off-Line Pre-computation, Reliable Publishing and Subscribing, Implementing Persistent and Reliable Message Delivery, and Implementing Query-Response Interactions By Mapping Data Advertisements as Subscriptions and Queries as Notifications in a Publish-Subscribe Network,” filed Feb. 19, 2003. The present application is also a Continuation-in-Part (CIP) of U.S. patent application Ser. No. 10/199,356, entitled “Packet Routing Via Payload Inspection,” U.S. patent application Ser. No. 10/199,368 now U.S. Pat. No. 7,545,805, entitled “Method And Apparatus For Content-Based Routing And Filtering At Routers Using Channels,” U.S. patent application Ser. No. 10/199,439 now U.S. Pat. No. 7,117,270, entitled “Method For Sending And Receiving A Boolean Function Over A Network”, U.S. patent application Ser. No. 10/199,369 now U.S. Pat. No. 6,910,033, entitled “Method For Storing Boolean Functions To Enable Evaluation, Modification, Reuse, And Delivery Over A Network,” and U.S. patent application Ser. No. 10/199,388 now U.S. Pat. No. 7,411,954, entitled “Efficient Implementation of Wildcard Matching On Variable-Sized Fields In Connect-Based Routing,” all filed Jul. 19, 2002 and all hereby incorporated by reference.

The present application also incorporates by reference the following U.S. Patent Applications, also CIPs of the above-referenced applications, filed herewith: application Ser. No. 10/400,671, entitled “Method and Apparatus for Reliable Publishing and Subscribing in an Unreliable Network,” application Ser. No. 10/400,444, entitled “Method and Apparatus for Propagating Content Filters For a Publish-Subscribe Network,” application Ser. No. 10/400,453, entitled “Method and Apparatus for Implementing Query-Response Interactions in a Publish-Subscribe Network,” and, application Ser. No. 10/400,462, entitled “Method and Apparatus for Implementing Persistent and Reliable Message Delivery.”

BACKGROUND OF THE INVENTION

Network bandwidth is increasing exponentially. However, the network infrastructure (including routers, servers, daemons, protocols, etc.) is still using relatively old technologies. As a result, Internet applications and network routers cannot keep up with the speed of the bandwidth increase. At the same time, more and more devices and applications are becoming network enabled. The load that these devices and applications put on the network nodes have increased tremendously. The increase of network load and number of applications also makes the complexity of implementing and maintaining network applications much higher. As a result, the increase of network bandwidth and the ubiquitous use of network devices and applications can cause problems for routing and transmission of data in the old network infrastructure, particularly when publishing content to subscribers.

A model for having networks push information from servers to clients is the publish-subscribe style. In this model, the server becomes a simplified publisher of its information, without regard to which clients may be interested in that information or where they are located in the network. The clients become subscribers for information, with information delivered as it becomes available, potentially without regard to details about where in the network it was published. The network is then responsible for efficiently routing published information to subscribers, for matching information to active subscriptions, and for doing all of this in a way that is transparent to the publishers and subscribers.

Because the complexity of the server is greatly reduced in the publish-subscribe model, the distinction between a heavyweight server and a lightweight client can begin to disappear, or rather to merge into the notion of a peer that can be either publisher, or subscriber, or both. Numerous kinds of applications have a natural affinity for publish-subscribe-style interaction between peers. A common theme underlying many of these applications is that the information being published and subscribed for is in the form of events. For example, an investor buys or sells a stock, causing the price of the stock to change. A traffic incident occurs on a freeway, causing traffic on the freeway to back up. A security hole in a software system is discovered, causing a patch to be developed for the users of the software. A player fires a weapon in an Internet game, causing another player's avatar to die. All of these exemplary phenomena are events that are potentially of interest to large numbers of subscribers and can be propagated over a network to notify those subscribers that the events happened. An event is thus simply a self-contained, succinct piece of information about something potentially interesting that happened at some point in time at some place on the network.

Another example involves a scheduled broadcast, which has differing characteristics from applications involving only asynchronous events where the time of events is unpredictable and random. First, the event is scheduled to take place at a known time. Secondly, an event does not need to be a succinct piece of information. Instead, it could be a massive amount of data. Directing this massive load of data to the parts of the network where interested subscribers are found requires substantial server processing.

Typically the server or publisher performs the routing decisions for the network in order to instruct the network on where to send published content in the publish-subscribe model. The publisher stores the subscriptions for content that it publishes. Upon receiving or generating new content, the publisher compares the content with each of the subscriptions to identify any matches. If the content (event) satisfies any subscriptions, the publisher pushes the content to the corresponding subscriber via the network. This conventional publish-subscribe model places a tremendous burden on the publishers, particular as more devices become network-enabled and as the number of subscriptions increases. A complementary approach can be just as odious-a subscriber evaluates its own subscriptions on all published events.

With greater convergence of untold numbers of applications across the Internet, the possibilities for exploiting event notification become endless. However, those possibilities require a more efficient way to make routing decisions and determine when events satisfy subscriptions, alleviating the burden on the publishers. Thus, a pervasive, persistent event notification service could provide tremendous value-added benefit for Internet applications, as well as other applications and implementations.

SUMMARY OF THE INVENTION

A method and apparatus provide for content-based routing of packets in a publish-subscribe network. A packet is received via the network. A map specifying pre-computed filter coverage in an attribute space is accessed. Content of the packet is inspected for a routing decision for the packet. The map is used for the routing decision for the packet. The packet is routed based upon the inspected content of the packet and the map. A router for content-based routing of packets in a publish-subscribe network, comprising modules for performing this method is provided. A network including a plurality of such routers is provided. A computer-readable medium including instructions for performing this method is provided.

A method and apparatus provide for content-based routing of packets in a publish-subscribe network. Attribute space is spatially quantized, wherein the spatially quantizing step creates a grid defining grid cells. Filter coverage information is computed based on a plurality of filters. Each filter has at least one predicated attribute a representation of the filter coverage information on the grid is generated. The routing actions predicated by the computed filter coverage information are mapped to a union of actions predicated by the filters. A content-based routing (CBR) table is updated. A router for content-based routing of packets in a publish-subscribe network, comprising modules for performing this method is provided. A network including a plurality of such routers is provided. A computer-readable medium including instructions for performing this method is provided.

An apparatus for use in content-based routing of packets is also provided. The apparatus includes a spatially quantizing module, a filter coverage information computing module, a mapping module, and a leakage reducing module. The spatially quantizing module creates and manages a grid, including information stored in the grid cells defined by the grid, in attribute space. The computing module computes filter coverage information based on a plurality of filters at the arrival of the filters and before that of the packets, and updates the information stored in the grid cells accordingly. Each filter has at least one predicated attribute, and the module generates a representation of the filter coverage information on the grid. The mapping module maps the grid to a union of routing actions predicated by the computed filter coverage information and updates a content-based routing (CBR) table based on the mapping.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings are incorporated in and constitute a part of this specification and, together with the description, explain the advantages and principles of the invention.

FIG. 1 is a diagram illustrating intelligent routing in a network core.

FIG. 2 is a network diagram illustrating intelligent routers for publishers and subscribers.

FIG. 3 is a diagram illustrating a network infrastructure for intelligent routers and backbone routers.

FIG. 4 is a diagram of hardware components of an intelligent router.

FIG. 5 is a diagram of publisher and subscriber machines.

FIG. 6 is a diagram of channel managers for intelligent routers.

FIG. 7 is a diagram of software components in a user machine for interfacing the machine with intelligent routers

FIG. 8 is a diagram of software components for an intelligent router.

FIG. 9 is a diagram of a packet structure for a message.

FIG. 10 is a flow chart of a publisher method.

FIG. 11 is a flow chart of a subscriber method.

FIG. 12 is a diagram of channel and subscriber screens.

FIG. 13 is a flow chart of a content-based routing method.

FIG. 14 is a flow chart of a caching method.

FIG. 15 is a diagram illustrating a cache index.

FIG. 16 is a flow chart of an agent method for an outgoing message.

FIG. 17 is a flow chart of an agent method for an incoming message.

FIG. 18 is a diagram illustrating an example of encoding of a message.

FIG. 19 is a diagram of a database structure for storing subscriptions.

FIG. 20 is a flow chart of a wildcard method.

FIGS. 21A-21B are flow charts of a content-based routing method using pre-computation.

DETAILED DESCRIPTION Overview

An Internet-scale, or other distributed network-scale, event notification system provides applications with a powerful and flexible realization of publish-subscribe networking. In this system, an application program uses event notification application program interfaces (APIs) to publish notifications and/or to subscribe for and receive notifications about events occurring inside the network.

A notification in the system is given a subject, which is a string or other structure that classifies the kind of information the notification encapsulates. Also, a notification is completed with a set of attributes containing information specific to the notification. For example, an application might publish notifications about transactions on the New York Stock Exchange using the subject quotes.nyse and attributes symbol and price. The application might publish an individual notification having specific attribute values, for example with symbol equal to SNE (the stock ticker symbol for Sony Corporation) and price equal to 85.25. Most if not all of the attributes in a notification are predefined, in the sense that they are found in all notifications for the same family of subjects. However, publishers can add discretionary attributes on a per-notification or other basis in order to provide additional event-specific information. Therefore, not all or even any attributes need be predefined.

In this system, subscribers are not restricted to subscribing only for subjects or whole channels. Channels are further explained and defined below. They can include an hierarchical structure specifying, for example, a subject field and one or more levels of related sub-fields (sub-subjects). Thus, subscribers can provide much more finely-tuned expressions of interest by specifying content-based filters over the attributes of notifications. For example, a subscriber might subscribe for all notifications for the subject quotes.nyse having symbol equal to SNE and price greater than 90.00 (indicating perhaps a sell opportunity for a block of shares owned by the subscriber). All notifications matching the subscription can be delivered to the subscriber via a callback or other type of function that the subscriber provides at the time it registers its subscription or at other times. One subscription can be broken down into many filters.

The callback can perform many computations, including something as simple as writing a message to a terminal or sending an e-mail, to something more complex such as initiating the sale of a block of shares, and to something even more complex that initiates new publish-subscribe activity (for example, replacing the existing subscription with a new subscription for a buy opportunity at a price of 75.00, or publishing a new notification that the subscriber's portfolio has been modified).

Applications are aided in their publishing and subscribing activities by agents, for example. The agents can possibly make use of or be implemented with proxies. The agents, when used, provide network connectivity for outgoing notifications and subscriptions and delivery of incoming matching notifications to subscribers. Once a notification enters the network, the system's network of routers propagate the notifications to all subscribers whose subscriptions match the notification. One way of accomplishing this would be to broadcast the notification to all points of the network and then let the application agents decide whether the notification is relevant to their subscribers. However, this is not necessarily a scalable approach—the network would usually be quickly overwhelmed by the load of message traffic, especially in the presence of large numbers of active and verbose publishers. And even if sufficient bandwidth were not a problem, the subscribers would be overwhelmed by having to process so many notifications.

The system's exemplary network is much more efficient in the way it routes notifications. First, it can use multicast routing to ensure that a notification is propagated, for example, at most once over any link in the network. Second, it can employ a large number of sophisticated optimizations on filters to reduce as much as possible the propagation of notifications.

FIG. 1 is a diagram conceptually illustrating this intelligent routing in a network core. A publisher 14 transmits content in messages via an edge router 16 to a network core 10, used in a publish-subscribe network. A publish-subscribe network includes any type of network for routing data or content from publishers to subscribers. The content is transmitted via one or more channels 18 representing logical connections between routers or other devices. An intelligent router 12 in network core 10 determines whether to route or forward the message. In particular, intelligent router 12 can determine if the message includes content as subscribed to by a subscriber 24.

Each subscription encapsulates a subject filter and an attribute filter. Routers can possibly expand a subject filter to the set of matching subjects and merge attribute filters on a per-subject basis. An intelligent router evaluates the subject filter against the subject of notifications, and evaluates the attribute filter against the attribute values in notifications. The syntax for subject filters can possibly use wildcards, and the syntax for attribute filters can use Boolean expressions, both of which are further explained below. The term “filter” is used to describe a set of events that a subscriber is interested in receiving from publishers. Routing rules are generated from the filters and are used by intelligent routers to make routing decisions.

Therefore, if the entire filter set is not satisfied by a message 26, for example, intelligent router 12 drops (discards) message 26, meaning that the message is not forwarded. If any filter of the entire set is satisfied by a message 20 according to the evaluations of subject and attribute filters, for example, intelligent router 12 routes (forwards) message 20 via edge router 22 and possibly other devices to a subscriber 24, or performs other functions internal to router 12 with message 20, according to all the routing and/or action rules prescribed for the matching filter. The search will continue until either the entire set of filters has been exhausted, or decisions about all the rules have been obtained, whichever comes first.

This type of intelligent content-based routing in a network core provides for real-time data delivery of, for example, alerts and updates. Examples of real-time data delivery for alerts include, but are not limited to, the following: stock quotes, traffic, news, travel, weather, fraud detection, security, telematics, factory automation, supply chain management, and network management. Examples of real-time data delivery for updates include, but are not limited to, the following: software updates, anti-virus updates, movie and music delivery, workflow, storage management, and cache consistency. Many other applications are possible for delivery of information for subscriptions.

Table 1 illustrates storing of subscriptions with subjects and predicates for the filtering. They can be stored in any type of data structure, as desired or necessary, anywhere in the network. As explained below, the predicates are components of subscriptions. The subscriptions can be expressed in any way, examples of which are provided below.

TABLE 1 subscription 1 subject 1 predicate 1 . . . subscription N subject N predicate N

Table 2 provides an example of a publication and subscription for a quote server. This example is provided for illustrative purposes only, and subscriptions can include any number and types of parameters for any type of data or content.

TABLE 2 Quote Server Example Subject Tree Publication  Quotes.NYSE  subject = Quotes.NYSE  Quotes.AMEX  Attributes  Quotes.NASDAQ   Symbol = SNE   Price = 51   Volume = 1000000 Attributes Subscription  Symbol  Subject == Quotes.NYSE  Price  Filter  Volume   (Symbol == SNE) & (Price > 55)

The predicates provide the Boolean expressions for the subscription and the subjects provide an indication of a channel for the subscription. Subscriptions can be expressed in many different ways. Use of Boolean expressions is one such example and provides an ability to easily convert the subscription into a subject filter and an attribute filter for content-based routing. Subscriptions can alternatively be expressed without reference to a subject; however, use of a subject or channel (further explained below) provides a context for interpreting and applying filters to attributes.

The routing decisions can be accomplished in the network core and distributed throughout the network, alleviating processing burdens on publisher and subscriber machines, and significantly enhancing the efficiency of the network. FIG. 1 illustrates one publisher, one subscriber, and one intelligent router for illustrative purposes only; implementations can include many publishers, subscribers, and intelligent routers. The term intelligent router refers to a router or other entity having the ability to make routing decisions by inspecting the payload of a packet or message in a network core or other locations.

Network Infrastructure

FIG. 2 is a network diagram illustrating intelligent routers for publishers and subscribers. A routing entity 30 providing channel services is, for example, effectively layered on a network infrastructure, as explained below, for routing messages among intelligent routers. A publisher 32 conceptually includes, for example, an application 34 to receive an indication of published content, such as a pointer for retrieving the content, and an agent 36 to encode the content for network transmission via channel services 30. A collection of logically interconnected intelligent routers 38, 40, 42, 44, 46, and 48 route the content from the publisher using routing rules generated from subject filters and attribute filters for subscriptions. A plurality of links 39, 41, 43, and 45 provide the logical connections between intelligent routers 38, 40, 42, 44, 46, and 48. Other links 37 and 47 provide, respectively, logical connections between publisher 32 and intelligent router 38, and between a subscriber 54 and intelligent router 46. Subscriber 54 includes an agent 50 to detect and receive the subscribed content, and an application 52 to present the content.

A channel can include, for example, a related set of logical multicast connections implemented in a distributed manner. A channel in this exemplary embodiment is a logically related collection of network resources used to serve a community of publishers and subscribers exchanging content. The content is classified according to the channel subject namespace, and the resources are managed, controlled, and provisioned via channel services provided by channel managers. Multiple channels may share the same resources. Channels can provide a highly scalable directory service such as, but not limited to, the following examples: publisher and subscriber information, authentication and authorization information, message types, management information, and accounting and billing information. Channels can also provide, for example, persistence through caching, a fast data delivery mechanism, security, and user and network management. Channels can be used for any other purpose as well.

The filtering by the intelligent routers can occur in a network core to distribute routing decisions. In addition, intelligent routers can also function as edge routers connecting a user device, such as a publisher or subscriber, with the network core. Also, the same device connected to the network can function as both a publisher to push content to subscribers via routing decisions in the network and as a subscriber to received pushed content. The intelligent routers and channels can be connected in any configuration, as necessary or desired for particular implementations, and the configuration shown in FIG. 2 is provided for illustrative purposes only.

FIG. 3 is a diagram of an exemplary network infrastructure for intelligent routers and conventional backbone routers, also illustrating logical connections for channels. The intelligent routers in this example use existing backbone routers in the network, such as the Internet or other distributed network, and the intelligent routers are thus effectively layered on the backbone routers. In this example, Internet Service Provider (ISP) networks 58, 59, and 60 each include several backbone routers for conventional routing of messages or packets. A plurality of intelligent routers 61-70 are connected with one or more backbone routers in ISP networks 58, 59, and 60. Intelligent routers 61-70 are also interconnected by a plurality of links 73-85, representing examples of links, and can be connected to end user devices by the links as well. Intelligent routers 61-70 can be controlled by one or more administrator machines such as an entity 71, and one or more virtual private network (VPN) controllers such as an entity 72. The ISP networks 58, 59, and 60 would also be connected to publisher and subscriber machines (not shown in FIG. 3). The backbone routers in and among ISPs 58, 59, and 60 are interconnected in any conventional way within the existing network infrastructure.

The intelligent routers 61-70 and links 73-85, as illustrated, can be implemented using existing network infrastructure, and they provide for content-based routing in the network core. The links 73-85 represent logical connections between intelligent routers 61-70 and can be implemented using, for example, existing network infrastructure or other devices. A link, for example, can be implemented using a logical connection called the tunnel. A tunnel includes the hardware, and possibly software, network infrastructure for implementing a link, and one tunnel can be a component of multiple channels. The channels facilitate content-based routing in the intelligent routers by providing logical configurations for particular types of content and thus providing a context for attributes transmitted over the channels. Although intelligent routers can perform routing decisions without channels, the channels enhance the efficiency of content-based routing by the intelligent routers in the network core.

This exemplary embodiment includes use of channels and links. A link is a connection between two routers-albeit intelligent routers. A channel is a network entity encompassing a (typically large) collection of routers, configured statically or dynamically by the interconnecting links to achieve one-to-many or many-to-many logical connections. In particular, a channel is a top-level logical entity describing the essential characteristics of the channel. Under one channel, there could be many subjects. Each subject will form a sub-network (such as a multicast tree) involving a collection of interconnected routers. These subject-based sub-networks can be allocated, oriented, and configured in different manners. The channel, being a collection of all the sub-networks formed for the subjects under it, may resemble a mesh of networks, for example.

FIG. 4 is a diagram of exemplary hardware components of an intelligent router 92, which can correspond with any of the other referenced intelligent routers. A network node 90 can include intelligent router 92 connected with a conventional backbone router 95. Intelligent router 92 includes a processor 93 connected to a memory 94 and a secondary storage 97 (possibly implemented with a detached machine, for example), either of which can store data, as well as cache data, and store applications for execution by processor 93. Secondary storage 97 provides non-volatile storage of data. Under software control as explained below, processor 93 provides instructions to backbone router 95 for it to route (forward) or not route (discard) messages or packets based upon routing rules generated from subject filters and attribute filters for subscriptions. Although shown as implemented in a separate processor-controlled device, intelligent router 92 can alternatively be implemented in an application specific integrated circuit (ASIC) within backbone router 95 to provide the intelligent routing functions in hardware possibly with embedded software. The intelligent routing functions can also be alternatively implemented in a combination of software and hardware in one or multiple routing devices.

FIG. 5 is a diagram of exemplary publisher and subscriber machines. A publisher machine 100 or 118 can include the following components: a memory 102 storing one or more publisher applications 104 and an agent application 105; a secondary storage device 112 providing non-volatile storage of data; an input device 108 for entering information or commands; a processor 114 for executing applications stored in memory 102 or received from other storage devices; an output device 110 for outputting information; and a display device 116 for providing a visual display of information.

A subscriber machine 122 or 140 can include the following components: a memory 124 storing one or more applications 126 and an agent application 128; a secondary storage device 130 providing non-volatile storage of data; an input device 132 for entering information or commands; a processor 134 for executing applications stored in memory 124 or received from other storage devices; an output device 136 for outputting information; and a display device 138 for providing a visual display of information. Publisher and subscriber machines can alternatively include more or fewer components, or different components, in any configuration.

Publisher machines 100 and 118 are connected with subscriber machines 122 and 140 via a network 120 such as the network described above. Network 120 includes intelligent routers for providing distributed routing of data or content in the network core via packets or messages. Although only two publisher and subscriber machines are shown, network 120 can be scaled to include more publisher and subscriber machines. The publisher and subscriber machines can be implemented with any processor-controlled device such as, but not limited to, the following examples: a server; a personal computer; a notebook computer; a personal digital assistant; a telephone; a cellular telephone; a pager; or other devices. Network 120 with intelligent routers can include any wireline or wireless distributed network, connecting wired devices, wireless devices, or both. Network 120 can also potentially use existing or conventional network infrastructure.

FIG. 6 is a diagram illustrating channel managers 150 for intelligent routers. In this example, channel managers 150 are implemented with multiple servers 152, 154, and 156. Each server includes its own local storage 158, 160, and 162. Intelligent routers 164, 166, and 168 contact channel managers for information about particular channels. The channel managers can also provide for data persistence, fail over functions, or other functions. The channel managers thus provide the channel services, which include a database or set of databases anywhere in the network specifying, for example, channel-related information, properties for data persistence, user information for publishers and subscribers, and infrastructure information. The infrastructure information can include, for example, an identification of intelligent routers and corresponding tunnels connecting them, subjects for the channels, and attributes for the channels (a name and type for each attribute). Packets or messages can also carry channel-related information including identification of fixed attributes and variable attributes.

A user when on-line can download channel information. For example, a user can register by using a user name and password. Upon authenticating the user's log-on, the user can open (invoke) a channel and retrieve information about the channel from the channel managers. Publishers can use that information in publishing content, and subscribers can use that information for entering and registering subscriptions.

Each channel manager 152, 154, and 156, in this example, acts as a primary for each intelligent router. In particular, each intelligent router is provided two Internet Protocol (IP) addresses in this example, one for a primary channel manager and another for a back-up channel manager. The intelligent routers use those IP addresses to contact a channel manager and retrieve channel information. If the primary fails, an intelligent router can contact a back-up channel manager. The channel managers 152, 154, and 156 thus share data, as indicated by the lines connecting them, concerning channel properties and other information. Each channel manager also has a designated back-up so that if the channel manager fails, another one can take over processing for it. Devices in the network can use commands, for example, to retrieve channel information, examples of which are provided in Table 3. Intelligent routers can alternatively only have a primary channel manager or more than two channel managers.

FIG. 7 is a diagram of exemplary software components in a stack 180 in a user machine or device for connecting it with a network having intelligent routers. The user machine can be used as a publisher, subscriber, or both, and it can include the exemplary devices identified above. Stack 180 can include one or more user applications 182, which can provide for receiving subscriptions from a user, receiving channel information from a publisher, or receiving content or data to be published. User application 182 can also include any other type of application for execution by a user machine or device.

The stack 180 can also include, for example, an agent 184, an event library 186, a cache library 188, a channel library 190, a messaging library 192, and a dispatcher library 194. Agent 184 provides for establishing network connections or other functions, and Table 3 provides examples of commands implemented by agent 184, which can use proxy commands or other types of commands. Event library 186 logs events concerning a user machine or other events or information. Cache library 188 provides for local caching of data. Channel library 190 stores identifications of channels and information for them. Dispatcher library 194 provides connections with a control path 196, a channel manager 198, and one or more intelligent routers 200, and it can include the exemplary functions identified in Table 4. Messaging library 192 provides a connection with a data path 204.

Tables 5-9 provide examples of messaging APIs in the C programming language. Tables 5 and 6 provide examples of APIs to send and retrieve messages. Tables 7 and 8 provide examples of APIs to send and retrieve notifications. Table 9 provides examples of APIs to send and retrieve control messages. These APIs and other APIs, programs, and data structures in this description are provided only as examples for implementing particular functions or features, and implementations can include any type of APIs or other software entities in any programming language.

TABLE 3 Examples of Agent Commands command function pc.chn.open open channel, retrieve all information for channel, and locally cache it pc.chn.close close channel pc.chn.getRouterInfo retrieve information for routers on channel pc.chn.getAttributeInfo retrieve information for attributes of channel pc.chn.getProperties retrieve properties for channel

TABLE 4 Dispatcher Functions Server-Side Listens for connections (sits on accept). Creates a thread to handle each connection. The thread is responsible for receiving and processing all requests coming on that connection. Client-Side Creates a thread that initiates a connection and is responsible for receiving and processing all data coming into the connection.

TABLE 5 Example of API to Send a Message PC_Status PC_msg_init(ChannelHandle ch, PC_UINT chld, PC_UINT userid,   PC_TypeInfo* MsgType, PC_UINT msgTypeSize,   PC_msg_SessionHandle *sess); PC_Status PC_msg_cleanup(PC_msg_SessionHandle sess); PC_Status PC_msg_closeTransport(PC_msg_SessionHandle sess); PC_Status PC_msg_create(PC_msg_SessionHandle s, PC_msg_DataType dType,   PC_msg_MsgHandle *msg); PC_Status PC_msg_delete(PC_msg_MsgHandle msg); PC_Status PC_msg_clone(PC_msg_MsgHandle org, PC_msg_MsgHandle *new); PC_Status PC_msg_setSubject(PC_msg_MsgHandle msg, PC_CHAR *subject); PC_Status PC_msg_setSubjectint(PC_msg_MsgHandle msg,   PC_USHORT *subjectArray, PC_UINT arraySize); PC_Status PC_msg_setAttrByNameInt(PC_msg_MSGHandle msg,   const PC_CHAR *name, PC_INT value); // for each type PC_Status PC_msg_setAttrByPosInt(PC_msg_MsgHandle msg,   PC_UINT attributePos, PC_INT Value); // for each type PC_Status PC_msg_addAttrInt(PC_msg_MsgHandle msg, const PC_CHAR *name,     PC_INT value); // for each type PC_Status PC_msg_send(PC_msg_MsgHandle msg);

TABLE 6 Example of API to Retrieve a Message typedef struct_attribute {   PC_CHAR *name;   PC_TypeCode type;   void *value; PC_UINT arraySize; } PC_msg_Attribute; typedef struct_attributeArray {   PC_UINT     size;   PC_msg_Attribute **attrs; } PC_msg_AttributeArray; PC_Status PC_msg_init(ChannelHandle ch, PC_UINT chld, PC_UINT userid, PC_TypeInfo*   MsgType, PC_INT msgTypeSize, PC_msg_SessionHandle *sess); PC_Status PC_msg_cleanup(PC_msg_SessionHandle sess); PC_Status PC_msg_recv(PC_msg_SessionHandle sh, PC_msg_MsgHandle *msg); PC_Status PC_msg_ctrlRecv(PC_msg_SessionHandle sh, PC_msg_MsgHandle *msg); PC_Status PC_msg_getSequenceNum(PC_msg_MsgHandle msg, PC_UINT *seqNo); PC_Status PC_msg_getPublisherInfo(PC_msg_MsgHandle msg, PC_msg_PublicInfo *pub); PC_Status PC_msg_getSubject(PC_msg_MsgHandle msg, PC_CHAR **subject); PC_Status PC_msg_getSubjectInt(PC_msg_MsgHandle msg,   PC_USHORT **subjectArray, PC_INT *size); PC_Status PC_msg_getDataType(PC_msg_MsgHandle hMsg,   PC_msg_DataType *dataType); PC_Status PC_msg_getAttrByPosInt(PC_msg_MsgHandle msg,   PC_UINT pos, PC_INT *val); // for each type PC_Status PC_msg_getAttrValueByNameInt(PC_msg_MsgHandle msg,   const PC_CHAR *name, PC_INT *val); PC_Status PC_msg_getAttrTypes(PC_msg_MsgHandle msg, PC_TypeCode* Types,   PC_INT *arraySize); PC_Status PC_msg_getAttributeByPos(PC_msg_MsgHandle msg,   PC_UINT attributePos, PC_msg_Attribute **attr); PC_Status PC_msg_getAttributeByName(PC_msg_MsgHandle msg,   const PC_CHAR *name, PC_msg_Attribute **attr); PC_Status PC_msg_getPredefinedAttributes(PC_msg_MsgHandle msg,   PC_msg_AttributeArray **attrs); PC_Status PC_msg_getDiscretionaryAttributes(PC_msg_MsgHandle msg,   PC_msg_AttributeArray **attrs); Void PC_msg_freeAttribute(PC_msgAttribute *attr); Void PC_msg_freeAttributeArray(PC_msg_AttributeArray*attrArray);

TABLE 7 Example of API to Send a Notification ChannelHandle ch; PC_msg_MsgHandle msg; PC_msg_SessionHandle sh; PC_msg_TypeInfo Types[2]; Types [0].type = PC_STRING_TYPE; Types [0].name = “company” Types [1].type = PC_INT_TYPE; Types [1].name = “stockvalue” PC_msg_init(ch, chld, userld, Types, 2, &sh) PC_msg_create(sh, PC_MSG_DATA, &msg); PC_msg_setAttrValueByNameInt(msg, “stockvalue”, 100); PC_msg_setAttrValueByPosString(msg, 1, “PreCache”); PC_msg_addAttrString(msg, “comment”, “mycomments”); PC_msg_send(msg); PC_msg_delete(msg); PC_msg_closeTransport(sh);   PC_msg_cleanup(sh);

TABLE 8 Example of API to Retrieve a Notification ChannelHandle ch; PC_msg_MsgHandle msg: PC_msg_SessionHandle sh; PC_msg_TypeInfo Types[2]; PC_msg_AttributeArray *attrArray; PC_CHAR *company; PC_INT value; Types [0].type = PC_STRING_TYPE; Types [0].name = “company” Types [1].type = PC_INT_TYPE; Types [1].name = “stockvalue” PC_msg_init(ch, chld, userld, Types, 2, &sh); While (1) {   PC_msg_recv(sh, &msg);   PC_msg_getAttrValueByPosString(msg, 0, &company);   PC_msg_getAttrValueByNameInt(msg, “stockvalue”, &value);   PC_msg_getDynamicAttributes(msg, &attrArray);   PC_msg_freeAttributeArray(attrArray);   PC_msg_delete(msg); } PC_msg_closeTransport(sh);   PC_msg_cleanup(sh);

TABLE 9 Example of APIs to Send and Retrieve Control Messages Sender Side Code Receiver Side Code ChannelHandle ch; ChannelHandle ch; PC_msg_MsgHandle mh; PC_msg_MsgHandle msg; Int chld = 10; PC_msg_init(ch, chld, subld, NULL, 0, &sh); // Get a Channel handle for channel 10 PC_msg_init(ch, chld, publd, NULL, 0, for (;;) { &sh)   PC_msg_recv(sh, &msg); PC_msg_create(th,   PC_msg_getSubject(msg, &subject); PC_MSG_CONTROL,   PC_msg_getAttrValueByNameInt(     &mh);     msg, “Channelld, &chld); PC_msg_setSubject(mh,   PC_msg_getAttrValueByNameString( “#.ADD_SUBJECT”);     msg, “Subject”, &subject); PC_msg_addAttrInt(mh,,“Channelld”,   PC_msg_delete(msg);     chld); } PC_msg_addAttrString(mh, PC_msg_closeTransport(sh);     “Subject”, “Quote.cboe”); PC_msg_cleanup(sh); PC_msg_send(mh); PC_msg_delete(mh);

FIG. 8 is a diagram of exemplary software components 210 for an intelligent router such as those identified above and intelligent router 92 shown in FIG. 4. Software components 210 can be stored in, for example, memory 94 for execution by processor 93 in intelligent router 92. Components 210 include, for example, a filtering daemon 212, a dispatcher 214, a routing daemon 216, and a cache manager 218. Filtering daemon 212 provides filtering for content-based routing to process content for subscriptions according to routing rules, as explained below. Dispatcher 214 provides for communication of control messages such as those required for propagating filters via path 220, and the dispatcher can also provide for a single point of entry for users and one secure socket with channel managers, enhancing security of the network. In other words, users do not directly contact channel managers in this example, although they may in alternative implementations. Dispatcher 214 uses control messages to obtain attributes (name-value pairs) from a channel manager.

Routing daemon 216 provides for communication with a data path 222, which can occur via a conventional backbone router as illustrated in FIG. 4 or other routing device. Cache manager 218 provides for local caching of data at the network node including the corresponding intelligent router. The operation of cache manager 218 is further explained below, and it provides for distributed caching of data throughout the network core.

Content-based routing can be implemented at the kernel level, as an alternative to the application level. Memory accessible by the kernel is separate from that in the application layer. To have content-based routing running in the application requires, for example, that message data be copied from the kernel memory area to the application area, and switching the context of the application from that of the kernel to that of the routing application. Both can induce substantial overhead. If instead the kernel is modified to support content-based routing, the routing could take place much faster being rid of the overhead described above.

With this feature of content-based routing in the kernel, the routing daemon 216 may or may not directly send or receive data via the data path 222, depending on the implementation. The daemon is a process running in the application layer, pre-computing the content-based routing table to be injected into the kernel. Once injected, however, the routing table can be used by the kernel to make routing decisions. Similarly, the filtering daemon pre-computes the filtering table and injects it into the kernel. In this kernel implementation, neither the routing daemon nor the filtering daemon would directly interact with the data path.

FIG. 9 is a diagram of an example of a packet structure 230 for a message possibly including content for subscriptions. A packet or message for use in content-based routing includes, for example, a header section and a payload section. The header section specifies routing or other information. The payload section specifies data or content, or an indication of the data or content. Packet structure 230 includes an IP header 232, a User Datagram Protocol (UDP) Transmission Control Protocol (TCP) header 234, a length value 238, one or more subject fields 240, and one or more attributes 242. Packet structure 230 illustrates a basic structure for a length value and the subjects and attributes. A packet used in content-based routing can also include other or different elements, such as those illustrated in the example of FIG. 18 explained below, and packets for content-based routing can be configured in any manner. Also, the attributes can include discretionary attributes appended to the end of a message, for example. These discretionary attributes are ad-hoc information, for example, added by the publisher (or even routers) that cannot necessarily be conveyed using the message format prescribed for the channel.

Publisher and Subscriber Methodologies

FIG. 10 is a flow chart of an exemplary publisher method 250 for use by a publisher to set-up a channel and publish content. Method 250 can be implemented, for example, in software modules including agent 106 for execution by processor 114 in publisher machine 100. In method 150, agent 106 in the publisher machine receives a publisher creation of a proxy for a channel (step 252). The proxy provides for communication with the network. Agent 106 determines a message format for the channel through an interface (step 253), and the format information can be obtained from, for example, the channel managers or other entities in the network. Agent 106 sets up the proxy for the channel using the received channel information (step 254), which includes receiving attributes for the channel (step 256) and creating a notification on the channel (step 258). The notification provides content for devices “listening” for content on the channel. The attributes define parameters and characteristics for the notification.

Agent 106 transmits an identifier (ID) of the channel and content information to intelligent routers in the network core or elsewhere for use in processing subscriptions (step 260). The publisher populates the notification attributes with appropriate values (step 261), and the publisher can then publish content on notification in accordance with the channel attributes (step 262). Steps 260-262 in this example accomplish publishing the notification, which can alternatively involve different or additional steps depending upon a particular implementation. Therefore, the information associated with a notification in this example is partitioned into an ordered sequence of attributes, each of which has a name, a position within the notification (starting at 1), a type, and a value. Alternatively, attributes can have different characteristics depending upon a particular implementation. Attributes can include, for example, predefined attributes, discretionary attributes, or both.

The intelligent routers can use the channel ID in a packet to obtain the attributes for the corresponding channel, which determines the structure or format for packets transmitted via the channel. In particular, each packet can contain, for example, a tag associated with a channel ID and other header information such as a publisher ID and subjects. The tags can be used to map subjects to numbers in the message format, an example of which is shown in FIG. 18. Small integer values, for example sixteen bit values, can be used for the numbers. Alternatively, any other type of numbers or information can be used to map the subjects. Mapping subjects to numbers can provide particular advantages; for example, it can save space in the message format and provide a uniform or standard way to specify indications of the subjects in the message so that they can be quickly located and identified. Intelligent routers can locally store the mapping or, alternatively, use the numbers to remotely obtain the corresponding subject through a command.

Table 10 illustrates a structure for mapping numbers to subjects, in this example using integer values. The subject tree parameter in the table indicates that a subject can include one or more subject fields in an hierarchical relationship; for example, a subject tree can include a string of subject fields demarcated by particular symbols. Examples of subject trees are provided in Table 2. As an example, a subject tree quotes.nyse includes a subject “quotes” and a sub-field “nyse” with those two terms demarcates by a “.” as found in URLs or other network addresses. Aside from using periods and specifying URL-type strings, subject trees can be specified in any way using any characters and symbols for demarcation.

TABLE 10 Number Subject Tree integer value 1 subject tree 1 integer value 2 subject tree 2 . . . . . . integer value N subject tree N

Thus, knowing the packet format or structure for a particular channel, the intelligent routers can quickly locate subjects and attributes, or other information, in the packet for content-based routing. For example, a channel can specify byte positions of subjects and attributes transmitted over the channel, making them easy to locate by counting bytes in the packet. Alternatively, intelligent routers can parse packets to locate subjects and attributes, or other information.

Table 11 provides an example of a publisher program in the C++ programming language. Table 12 provides an example of an API to create a channel. Table 13 provides an example of a channel configuration file maintained by a channel manager (see FIG. 6) and providing channel-related information, as illustrated. The system can alternatively have a global channel manager providing IP addresses of geographically dispersed servers functioning as local channel managers in order to distribute the processing load.

TABLE 11 Example of Publisher Program #include “PC_evn_Notification.h” #include “PC_evn_Proxy.h” using namespace precache::event; int main(int argc, char argv[]) {   PC_UINT QuotesRUs = myChannelofInterest; // channel ID   PC_UINT myID = myPublisherID; // publisher ID   try {     Proxy p(QuotesRUs, myID);     Notification n1(p, “quotes.nyse”);     n1.SetPredefinedAttr(“symbol”, “LUS”);     n1.SetPredefinedAttr(price”, 95.73);     p.Publish(n1);     Notification n2(p, “quotes.nyse”);     n2.SetPredefinedAttr(1, “SNE”); // attribute symbol is in     position 1     n2.SetPredefinedAttr(2, 80.18);// attribute price is in position 2     p.Publish(n2);   }   catch (InvalidChannelException icex) {     cerr << “bad channel” << endl;   }   catch InvalidSubjectException isex) {   }   catch (InvalidNotificationException inex) {     cerr << “bad notification” << endl;   }   catch (Exception ex) {     cerr << “unknown error” << endl;   } }

TABLE 12 Example of API to Create a Channel PC_Status rc; rc = PC_chn_create(Provider_info, authinfo, ConfigurationFile, &hChannel); /* the first one primary channel manager */ rc = PC_chn_addChannelManager (hChannel, “10.0.1.1”); /* secondary channel manager */ rc = PC_chn_addChannelManager (hChannel, “10.0.2.2”); */ rc = PC_chn_setProperties (hChannel, ConfigurationFile); /* Set the message type (only in fixed part of the message) by using rc = PC_chn_setAttributeType(hChannel, name, position, attributeType). The type information is propagated to all edge routers. */ rc = PC_chn_setAttributeType(hChannel,”Priority”,1,PC_UINT 16_TYPE); rc = PC_chn_setAttributeType(hChannel,”Alarm_Name”,2, PC_STRING_TYPE); rc = PC_chn_setAttributeType(hChannel,”Alarm_Time”,3, PC_INT32_TYPE); rc = PC_chn_updateAttribute(hChannel); rc = PC_chn_close(hChannel); /* finish channel creation */

TABLE 13 Example of a Channel Configuration File # Channel Setup —Read by Channel API, event and messaging # Each channel entry information is tagged with the # type of information e.g. # [ChannelComm 5] for Channel 5 Communication related information # [ChannelSubjects 5] for subject related information in channel 5 # [ChannelAttributes 5] for attribute information in channel 5 # # The Channel id is appended to the tag to indicate # the channel that the information belongs to # e.g. [ChannelComm 5] indicates routing information # for channel 5. # # All the fields need not be set. For example if # running with the central server, the MulticastIP is # not needed. [ChannelComm 5] MulticastIP=225.0.0.1 RouterIP=test3 RouterPort=12345 ProxyPort=9015 ProxyCtrlPort=9016 [ChannelSubjects 5] NumberOfSubjects=2 subject1= #.SUBSCRIPTION mapping1=0.100 subject2=Quotes.Nyse mapping2=102.101 [ChannelAttributes 5] NumberOfAttributes=4 name1=StockId type1=PC_UINT_TYPE name2=Company type2=PC_CHARARRAY_TYPE name3=Price type3=PC_FLOAT_TYPE name4=Volume type4=PC_UINT_TYPE

FIG. 11 is a flow chart of a subscriber method 264 for use in receiving and processing subscriptions. Method 266 can be implemented, for example, in software modules including agent 128 for execution by processor 134 in subscriber machine 122. In method 264, a graphical user interface (GUI), for example, presents an indication of available channels to a user (step 266), which can be accomplished by application 126.

The information identifying the channels can be received from, for example, the channel managers providing channel-related information. Any type of application 126 can be used for presenting identifications of channels in any particular way or format. The application receives a user's selection of a channel (step 268) and calls an API or other program for the selected channel (step 270). The API presents subscription options to the user for the channel corresponding with the selected option (step 272). The API receives values for the subscription from the user (step 274) and sends the subscription to agent 128 for processing, as explained below (step 276). The parameters for the subscription can include, for example, the predicates as illustrated in Table 1. Each channel can use its own API, for example, in order to process subscriptions according to the particular requirements or parameters for the corresponding channel. These APIs can include, for example, web-based or Java-based APIs for receiving subscriptions and can use any type of user interface and processing to receive information for a subscription and pass it along to the agent application.

FIG. 12 is a diagram conceptually illustrating channel and subscriber screens or GUIs 278 and 284, which can be used in conjunction with method 264 for receiving a subscription. Screen 278 includes a plurality of sections 282 identifying available channels for selection by a user. Upon selection of a particular channel, screen 284 can be displayed for receiving a user's values for the subscription in a section 286. A user can select a section 288 to submit the subscription or select a section 290 to cancel the subscription. Screens 278 and 284 can be formatted as, for example, HyperText Markup Language (HTML) web pages or in any other format. Also, the screens can include any configuration of sections and content, possibly including, for example, text, graphics, pictures, various colors, or multi-media information in order to provide, as desired, a user-friendly and visually appealing interface for subscribers. The screens can also include a toolbar 280 providing, for example, conventional browser functions.

Table 14 provides an example of a subscriber program in the C++ programming language.

TABLE 14 Example of Subscriber Program #include <unistd.h> #include <iostream> #k c.jde “PC_evn_Filter.h” #include “PC_evn_Subscription.h” #include “PC_evn_Proxy.h” using namespace precache::event; class SubscriberApp : public Subscriber { private”:   PC_UINT notificationCount = 0; public:   SubscriberApp( ) {} ?? default constructor   void run( )   {     PC_UINT QuotesRUs = myChannelofInterest; // channel ID     PC_UINT myID = myPublisherID; // publisher ID   try {       Proxy p(QuotesRUs, myID);       FilterFactory* factory = FilterFactory:: GetFilterFactory( );       Filter* f = factory->CreateFilter(p, “symbol == \“LU\””);       PC_INT c1 = 0;       SubscriptionHandle sh = p.Subscribe(“quotes.nyse”, f, this, (void*)&c1);       while (notificationCount < 2) {    // let notify( ) get       some notifications         sleep(5);       }       p.Unsubscribe(sh);     }     catch (InvalidChannelException icex) {       cerr << “bad channel”<< endl;     }     catch (InvalidSubjectException isex) {       cerr << “bad subject” <<endl;     }     catch (InvalidChannelException ifex) {       cerr << “bad filter”<< endl;     }     catch (InvalidSubscriptionHandleException ishex) {       cerr << “bas subscription handle” << endl;     }     catch (Exception ex) {       cerr << “unknown error” <<endl;     }   }   void Notify(Notification* n, void* c)     // this is the   callback method   {     if (*(PC_INT*)c == 0) { // check the closure object       PC_STRING symbol;       PC_FLOAT price;       n->GetPredefinedAttr(“symbol”, symbol);       n->GetPredefinedAttr(“price”, price);       cout << “The price of“ << symbol << “ is ” << price <<       endl;;       notificationCount++;     }   } }; int main(int argc, char argv[]) {   SubscriberApp a;   a.run( );   }

Content-Based Routing Via Payload Inspection and Channels

FIG. 13 is a flow chart of a content-based routing via payload inspection method 300. Method 300 can be implemented, for example, in software modules for execution by processor 93 in intelligent router 92, as represented by filtering daemon 212. Alternatively, it can be implemented in an ASIC or a combination of hardware and software. The content-based routing as illustrated in method 300 can be performed in intelligent routers anywhere in the network, such as in the network core or in edge routers.

In a general sense, the content-based routing involves inspecting a payload section of a packet in order to determine how to process the packet. This content-based routing methodology can include, for example, processing a list of subscriptions (using filters, for example) in any order, comparing a message subject-by-subject and attribute-by-attribute with routing rules to determine a routing for the message, and performing the processing in a network core. The rules can include rules governing in-router processing or any rules associated with a filter. These routing decisions can thus be distributed throughout a network core. The use of subjects as represented by channels determines a message format, thus providing an intelligent router with a way of quickly locating attributes within the message, for example by knowing their byte positions in the message or packet for a particular channel.

In method 300, intelligent router 92 receives a packet for a message (step 302). It determines from the packet a channel ID for the corresponding message (step 304) and retrieves attributes for the channel using the channel ID (step 306). In this example, the type of channel (determined from the channel ID) determines locations and data types of attributes in the packet. The attributes for the channel can be locally stored or retrieved remotely such as via a channel manager. Intelligent router 92 retrieves a filter, which corresponds with a subscription (step 308). The filter includes one or more attribute tests, usually a group of attribute tests for subscriptions. Intelligent router 92 applies attributes in the packet to the corresponding attribute test(s) in the filter description (step 310).

If all the attribute test(s) in the filter description produce a positive result (step 312), meaning the attributes satisfy all the attribute test(s), the intelligent router executes a set of functions prescribed by the rules associated with the filter (step 314). These functions can include, for example, routing the packet to the next link, and/or performing some action or computation with the content of the packet at the local router as prescribed by the rule(s). The action or next link can be identified, for example, in a data structure specifying the corresponding subscription. When the rule is a link, it typically identifies the next network node to receive the packet, which can include an intelligent router, backbone router, a network-connected device, or other entity. Alternatively, the next links can be specified or associated with the subscriptions in other ways.

If all the attribute test(s) in the filter description did not produce a positive result (step 312), meaning the attributes do not satisfy all the attribute test(s), the filter is declared a mismatch (step 315). The intelligent router recursively follows the above procedure until all the attribute tests in the filter description are exhausted or a first negative result is encountered, whichever comes first.

Once all the attribute tests have been processed for this filter, the intelligent router determines if more filters exist (step 316) and, if so, it returns to step 308 to retrieve the attribute test(s) for the next filter to process the attributes for it. The matching procedure (steps 308, 310, 312, 314, 315, and 316) continues until either the complete set of filters is exhausted, or results for all the action or routing rules can be determined, whichever comes first. If the packet does not satisfy any filter, it will be dropped (discarded) and not forwarded.

Intelligent router 92 can sequence through the filters in any particular order. For example, as illustrated in Table 15, intelligent router can store the filters for subscriptions in a file or routing table and linearly sequence through them to apply the attributes to filters (attribute tests). Alternatively, the routing table can include links or pointers to the filters.

The content-based routing can optionally use more than one method at the same time, depending on the applications and performance-enhancing heuristics such as the switching of algorithms based on traffic conditions, for example. The filters for the processing can optionally be encrypted, decrypted, transformed, and merged at a router in the network for use in performing inspecting of a payload section for the content-based routing. For example, a subscription such as price >$3.54122 may be truncated to price >$3.54 because the publications in the application are known not to contain currency attributes beyond the second decimal points. Also, foreign currency may be translated into U.S. currencies as well when a publication sent from overseas reaches the first router located in the U.S., for example.

As an alternative to a linear approach, intelligent router 92 can select filters for processing in other orders or according to various algorithms that can possibly enhance the speed and efficiency of processing. Table 16 provides examples of subscriptions and corresponding links for them; in these examples, the subjects relate to a particular channel and the subscriptions for the subjects can be represented by routing rules for the filters. The subjects can include, for example, network addresses such as Uniform Resource Locators (URLs) identifying a source of content.

TABLE 15 Subscriptions Links Channel 1 filter 1a links 1a filter 2a links 2a . . . . . . filter Na links na Channel N filter 1N links 1a filter 2N links 1b . . . . . . filter NN links 1n

TABLE 16 Content Predicate Links sub = “quote.optimist” & x10, x11 ( ($l > 5 & $2 = “LU”) | ($1 > 30 & $2 = “T”)) (sub = “sonymusic” | sub = “sony.movie”) x11, x13 & $1 > 30 & $4 = “Beethoven” sub = “movie.ratings” & x11, s15 ($1 > 1999 | $2 = “Kurosawa”) & $3 = “**”

Caching at Network Nodes

FIG. 14 is a flow chart of a caching method 320. Method 320 can be implemented, for example, in software modules for execution by processor 93 in intelligent router 92, as represented by cache manager 218. Alternatively, it can be implemented in an ASIC or a combination of hardware and software, either in the same or different physical device as the corresponding intelligent router. In method 320, intelligent router 92 receives a message having data or content, a channel ID, and subjects (step 322). Intelligent router 92 time marks the data (step 324) and locally caches it such as in memory 94 or secondary storage 97 (step 326). It indexes the cached data by, for example, channel ID, subjects, and time stamps (step 328).

If intelligent router 92 receives a request for data (step 330), it retrieves cached data, using the index, according to the request (step 332). Intelligent router 92 transfers the cached data to backbone router 95 or other routing entity for eventual transmission to the requestor or others. Method 320 can be repeatedly executed in order to continually cache data and retrieve cache data in response to requests.

FIG. 15 is a diagram illustrating a cache index (336) for use with method 320. Cache index (336) receives data (338) and stores it with time stamps (340). As data is gathered, it is marked upon every duration of delta t, where delta t represents the time between marks, for example t₂−t₁. Other types of indexes for time marking in any way can alternatively be used.

Table 17 conceptually illustrates indexing of cached data. Table 18 conceptually illustrates a data structure for storing a connection history for caching. Table 19 provides examples of data structures for use in locally caching data in network nodes having intelligent routers.

The time marking can occur at any fixed or variable interval. For example, data can be cached and indexed every five minutes. Upon receiving a command to retrieve cached data (such as #.getCache) specifying a time and subject, channel manager 218 uses the cache index to determine if it can retrieve cached data corresponding with the request for step 332.

Each subject or channel can include, for example, its own IP address in a multicast tree and a set of intelligent routers. Therefore, Table 18 represents a connection history among such routers that can be locally stored a user machine; if an edge router fails, the machine can access the connection history to determine how to reconnect with upstream routers for the channel when the edge router comes back on-line. It can also execute a get cache command for the duration of the time that it was disconnected in order to obtain any pending content for subscriptions, for example.

TABLE 17 t₁ channel ID 1 subjects 1–n pointer 1 to cached data t₂ channel ID 2 subjects 1–n pointer 2 to cached data t_(n) channel ID N subjects 1–n pointer N to cached data

TABLE 18 Connection History time router network addresses t₁ R2 UR2 UR3 t₂ R2 UR2 UR3 . . .

TABLE 19 Examples of Cache Data Structures for Intelligent Router Channel Node Struct ChannelNode {   PC_UINT unChanld;   PC_AttributeInfo *pAttrinfo;   PC_BOOL bPersistent; /* Persistent or RT*/   PC_UINT unTimeout;   PC_UINT unTimeGranularity;/* in minutes */   PC_INT nDirFd;   HashTable *pFirstLevelSubjs;   } Subject Node Struct SubjectNode {   PC_USHORT unSubjectld;   PC_UINT unSubjLevel;   Void pParent;  / Channel or Subject */   PC_INT nDirFd;   HashTable *pNextLevelSubjs;   DataNode *pData; } Data Node Struct DataNode {   PC_INT nDirFd;   SubjectNode *pParent;   LastTimeGrainNode *pLastTGrainData;   DLIST *pStoredData;/*list StoredTimeGrainNode */   PC_Mutex mStoredDataLock;   } Stored Time Grain Node Struct StoredTimeGrainNode {   PC_UINT unStartTime; /* in minutes */Chanld;   PC_UINT unEndTime; /* in minutes */   PC_INT nFd; } Last Time Grain Node Struct LastTimeGrainNode {   PC_CHAR pLastTGrainData; / could be a list */   PC_UINT unLastTGrainStartTime;   PC_BOOL bReadyToStore;   PC_Mutex mCachedDataLock; }

These exemplary data structures include the following information. A subject node contains a subject identifier, subject level, pointer to parent channel or subject node, file descriptor for its own directory, pointer to hash table containing its next level subject nodes, and pointer to a data node. A data node contains a pointer to its subject parent node, file descriptor for the data directory, circular buffer containing the data structures for the data stored on each storage device, head and tail of the buffer, and lock for locking the data node during retrieval and storage. The stored time grain node is the node representing the actual data file, and the last time grain node represents the last buffer that has not yet been stored to the storage device but is maintained in memory. The caching and data storage threads in this example use the mutex of the last time grain node for preventing concurrent access to the last time grain node.

Agent Processing

FIG. 16 is a flow chart of an agent method 350 for an outgoing subscription message. Method 350 can be implemented, for example, in software modules as represented by agent 128 for execution by processor 134 in user (subscriber) machine 122. In method 350, agent 128 receives a subscription such as via the method described above in FIGS. 11 and 12 (step 352). Agent 128 creates a string specifying a Boolean expression for the subscription (step 354) and parses the string to detect any errors in the subscription (step 356). If an error exists, agent 128 can present an error message to the user (step 360) in order for the user to correct the error and re-enter the subscription. If the subscription contains no errors (step 358), agent 128 stores the expression in a data structure, an example of which is provided below (step 362). Agent 128 translates constituent not-equal expressions in the data structure to positive form (step 364) and translates the data structure to a corresponding disjunctive normal form (DNF) structure (step 366). Agent 128 also simplifies AND expressions of the DNF structure to contain only range filters and membership tests (step 368).

The DNF is a well-known canonical form in which a Boolean expression is represented as an OR of one or more sub-expressions called disjuncts, each sub-expression being an AND of one or more attribute tests. For example, the Boolean expression (price>=10 AND (symbol==“LU” OR symbol==“T”)) has an equivalent DNF representation of ((price>=10 AND symbol==“LU”) OR (price>=10 AND symbol==“T”)).

The transformation in step 364 involves translating expressions having the “not-equal” operator (represented in an exemplary syntax as !=) into an equivalent “positive” form that specifies all allowed values rather than the one disallowed value. This transformation is performed prior to creation of the DNF, and it is needed because the routers in this example require formulae to be in positive form. For example, the expression (price !=80) can be transformed to the equivalent positive expression (price<=79 OR price>=81).

The transformation in step 368 is performed after the DNF is created and involves an extra simplification of the resulting AND expressions, and it is also performed to simplify the work of the routers in this example. In particular, an AND of multiple attribute tests for the same attribute can be simplified into a canonical “range filter” having either one lower bound, one upper bound, both a lower and upper bound, or a single value in the case of an equality test. The particular kind of range filter is then encoded according to Table 22.

For example, the expression (price>=10 AND price<=80 AND price>=20 AND price<=100) can be simplified to the expression (price>=20 AND price<=80), which is an example of a range filter with both a lower and an upper bound. Examples of the other kinds after simplification are the following: (price>=20) (lower bound only); (price<=80) (upper bound only); and (price==50) (single value). In creating these range filters, it is possible that some sub-expression will simplify to true or to false, in which case the sub-expression can be eliminated according to the laws of Boolean algebra, thereby further optimizing the encoding of the expression in a message. For example, the expression (price>=50 AND price<=20) simplifies to false, since no value for “price” can satisfy the expression. In the special case in which a whole filter expression simplifies to false, the agent need not create a message at all, thereby relieving the router of unnecessary work.

If the subject filter contains wildcards, agent 128 can optionally convert them as explained below (step 370). Otherwise, any wildcards can be converted in the network, rather than on the user machine or other device. In this exemplary embodiment, the syntax for subject filters is the only syntax that uses wildcards, and the syntax for attribute filters is the only syntax that uses Boolean expressions. Alternatively, implementations can use different or varying types of syntax for subject filters and attribute filters.

Agent 128 encodes the resulting DNF expression into a message (step 372) and transfers the message to an intelligent router (step 374). The encoding can involve converting the subscription to a flat message format, meaning that it constitutes a string of data. This transferring can involve propagating routing rules generated from subject filters and attribute filters for the subscription to one or more intelligent routers or other routing entities in the network. For the propagation, the subscription expression can be mapped into a conventional packet structure, for example.

The encoding for step 372 involves marshalling subscriptions for a channel into a messaging format of the messaging API for propagation throughout a channel. A subscription is internally messaged, for example, as a notification with subject #.SUBSCRIPTION. Because there are both a variable number of subject filter fields and a variable number of attribute tests, one pair of bytes is used to store the number of subject filter fields, and another pair of bytes is used to store the number of attribute tests in this example. The individual fields of the subject filter are marshaled sequentially, for example, in the order in which they were specified in the original subscription and are each marshaled into a two-byte portion of the message. Wildcard fields can be marshaled as described below.

In marshaling the attribute tests, the operands of the tests are marshaled at the end of the message in a manner similar to the marshaling of attribute values of notifications. Prior to marshaling the attribute tests and operands, they are sorted by attribute order within each disjunct of the DNF with tests on predefined attributes in position order, followed by tests on discretionary attributes in name order. Furthermore, the set of relational tests on scalar valued attributes within each disjunct are simplified to a canonical form as range filters having either one limit (for left- or right-open ranges or equality tests) or two limits (for closed ranges between distinct limits). The remaining information about the tests is encoded into, for example, two-byte pairs in the same order as the operands; this sequence of two-byte pairs is placed in the message immediately following the sequence of two-byte encoding of subject filter fields. The two-byte pairs can constitute one form of a sequence of bit-string encodings of attribute tests, which can also be used to represent other types of encodings aside from two-byte pairs. Examples of attribute tests are provided below.

The schema for the encoding of the attribute tests is depicted in Table 20. Table 21 illustrates encoding for the two-byte pairs, and Table 22 illustrates encoding of the Operator ID in the two-byte pairs.

TABLE 20 Encoding Rules 1 A zero in the D bit indicates the beginning of a new disjunct in the DNF, while a one in the D bit indicates an additional conjunct within the current disjunct. 2 A value other than all ones in the Notification Attribute Position indicates the position of a predefined attribute (as defined by the channel's notification type) to which the test applies; the operand for the test is marshaled as depicted in the example shown in FIG. 18. 3 A value of all ones in the Notification Attribute Position indicates that the test applies to a discretionary attribute, in which case the name length and name of the attribute to which the test applies are marshaled with the operand. 4 The bits for the Operand Type ID encode one of the predefined types for attributes. 5 The bits for the Operator ID encode the operator used in the test, as defined in Table 22.

TABLE 21 0 1 2 3 4 5 6 7 First Byte D Notification Attribute Position Second Byte Operand Type ID Operator ID

TABLE 22 Operator Operator ID Left-open range 000 Right-open range 001 Closed-range 010 Equality test 011 Positive membership test (in) 100 Negative membership test (not in) 101

Because the two-byte pair for a test already indicates both the type of the operand of the test and whether or not the test applies to a predefined or discretionary attribute, there is no need to separately marshal the number of tests performed on discretionary attributes or their types. This scheme assumes there are no more than 127 predefined attributes in a notification. Alternatively, this design may use more bits to encode attribute tests.

While this marshaling convention orders and groups attribute tests according to the DNF of the attribute filter, an infrastructure element (such as a router) may choose to evaluate the tests in some other order (perhaps according to dynamically derived local data about the probability of success or failure of the different tests) in order to make the overall evaluation of the attribute filter more efficient. The Subscription ID field of the message is a value generated by the agent for uniquely identifying the subscription to the agent's edge router in subsequent requests to modify or unsubscribe the subscription. In particular, a dynamic modification to the attribute filter of a subscription is propagated using the message format shown in the example of FIG. 18, except that the subject is #.RESUBSCRIPTION and the Subscription ID is that of the previously registered subscription being modified. And an unsubscription is propagated using, for example, the message format of FIG. 18 up through the Subscription ID field, with the subject being #.UNSUBSCRIPTION and the Subscription ID being that of the previously registered subscription being unsubscribed.

The following provides an example to illustrate the conversion and encoding by the agent as described above. Consider the following example attribute filter expression: price>=10 and (symbol==“LU” or (volume>=1000 and volume<=10000)). FIG. 19 presents a Unified Modeling Language (UML) diagram 390 depicting the objects used by the agent in step 362 to store the expression. This diagram illustrates an hierarchical relationship for specifying the subscription, which can include variables, constant values, or both. The objects in the diagram can be instances of filter classes depending upon a particular implementation. Each SimpleFilter object depicts the values of attributes used to store information about a corresponding attribute test of the filter expression. In the expression of FIG. 19, an OR filter 396 connects two AND filters 392 and 400. The AND filter 392 contains a simple filter 394 with attributes for the subscription. Likewise, the OR filter 396 contains a simple filter 398, and the AND filter 400 contains simple filters 402 and 404.

For the purposes of this example, attributes price, symbol, and volume are assumed to be predefined attributes of the associated channel and are assumed to be defined in positions 0, 1 and 2, respectively. Furthermore, the types of the attributes are assumed to be unsigned integer (typecode 6), character array (typecode 12), and unsigned integer (typecode 6), respectively.

Consider next a subscription containing the above example attribute filter expression as its attribute filter. FIG. 18 presents the marshaling of the subscription into a message. The schematic 386 on the left side of FIG. 18 shows the actual message contents, while the schematic 388 on the right provides a legend for the different parts of the message. The width of each schematic in this example is four bytes. Prior to marshaling, the filter has been converted to its equivalent DNF: (price>=10 and symbol==“LU”) or (price>=10 and volume>=1000 and volume<=10000).

The sixteen-bit attribute test encodings are shown as bit sequences, with gaps showing the separation into the different parts. Note that the two tests on price in this example cannot be combined since they are in separate disjuncts, and thus they are marshaled separately as ranges that have no right bound (“right-open ranges”). On the other hand, the two tests on volume can be combined since they are in the same disjunct, and thus they are marshaled together as a single “closed-range” test.

Finally, note also that certain fields are characterized as being “assumed”; this means that values for these fields were chosen arbitrarily for this example and are in general independent of the subscription that was marshaled. In addition, the subject filter for the subscription was arbitrarily chosen to be “>,” which matches any subject defined by the associated channel. The example described above and shown in FIGS. 18 and 19 is provided for illustrative purposes only, and the marshalling can be used with any other type of subscription. Also, method 350 provides only one example of marshaling subscriptions, and they can be marshaled in any other way.

FIG. 17 is a flow chart of an agent method 376 for an incoming message. Method 376 can be implemented, for example, by agent 128 and application 126 in user machine 122. In method 376, agent 128 receives a message from an intelligent router corresponding with a subscription (step 378). Agent 128 determines a channel corresponding with the subscription (step 380), for example by the channel ID in the message, and calls an API for the channel (step 382). The API present the data for the subscription in a GUI or other format at the user machine (step 384). The processing of incoming messages can use a process of decoding the data in the reverse of the encoding process described above, and this decoding (reverse encoding) can be performed in a router or in other network entities.

Wildcard Processing

FIG. 20 is a flow chart of a wildcard method 410. This method illustrates an example of using a set of routing rules for a filter to convert wildcards in expressions for subscriptions. Method 410 can be implemented, for example, in software modules as represented by agent 128 for execution by processor 134 in user machine 122. Alternatively, wildcards can be processed in the network by processor 93 under software control in intelligent router 92 or in the corresponding functions contained in ASIC 91. Wildcards include open fields or variable length fields, examples of which are provided in Table 21.

In method 410, agent 128 or other entity receives a subscription having a wildcard (step 412). The subject length for subscriptions can be specified by a publisher when publishing content, and the subject can be pre-processed on the publisher machine, for example, to count the fields of the subject and thus obtain a field count (length) for it. Agent 128 counts the number of fields in the filter operand (step 414) and initializes a new rule (filter) of field length=N (step 416). Agent 128 retrieves a sub-field for the subscription (step 418) and determines if the filter operand sub-field O[i] is a wildcard (step 420). If the filter operand sub-field is not a wildcard, agent 128 adds a conjunctive clause to the rule, field [i]=O[i] (step 422). If the filter operand has more sub-fields (step 424), agent 128 returns to step 418 to process additional sub-fields. The parameter “i” represents a field where i is an integer representing the field number in this example.

After processing the sub-fields, agent 128 determines if the last filter operand sub-field is a “>” (step 426) and, if so, it changes the length constraint to field length>N−1 (step 428). Wildcard processing can use any type of symbol, and a “>” is only one such example. In this example, a “a.>” can mean a.b, a.c, a.d, etc. and all their sub-subjects at all levels (for example, a.b.x, a.c.x, a.b.x.y, etc.). Other symbols can be used for other implementations of wildcards.

If necessary, agent 128 propagates the transformed rule to intelligent routers or other entities in the network (step 430). Accordingly, the method iterates through the sub-fields in order to process them for conversion of the wildcards to non-wildcard rules, meaning rules that do not contain wildcards. The conversion of wildcards can occur anywhere in the network, for example on the subscriber machine or in an intelligent router. The conversion can thus occur in one entity with the transformed rule propagated to other entities or it can occur dynamically.

Table 23 provides a summary, along with examples, of these exemplary routing rules for processing wildcards. These routing rules can be generated in the intelligent routers, for example, or generated in other network entities and propagated to the intelligent routers. In addition, the routing rules in Table 23 are provided for illustrative purposes only and other routing rules are possible for converting wildcards.

TABLE 23 Original Rule Transformed Rule subject = “ab” subject.length == 2 & subject[0] == “a” & subject[1] == “b” subject = “C.*.D” subject.length == 3 & subject[0] == “C” & subject[2] == “D” subject = “foo.>” subject.length > 1 & subject[0] == “foo” subject = “*.*.b.*.c.>” subject.length > 5 & subject[2] == “b” & subject[4] == “c”

CBR Using Compact Filter Storage and Offline Pre-Computation

The embodiment of CBR described in this section involves a method for routing data packets in the core of a publish/subscribe network, based on deep packet inspection and filter matching. By transforming filters into more compact forms and by pre-computing the filter coverage in the attribute space, this CBR method forms a map from a finite set of attribute spatial coordinates to routing instructions off-line and then utilizes the map in real time to make routing decisions. This CBR method is very fast, achieving a data-forwarding rate of the same order of magnitude as that of traditional Internet Protocol (IP) routing. Consequently, this CBR method is a suitable candidate for pragmatic commercial deployment of content-based routing in the core of a network.

As described above, subscribers refine the selectivity of packets transmitted from one or many publishers in a publish-subscribe network by specifying predicates over a range of attribute values. Each predicate is an attribute test (attribute tests may include a subject test as well) that relates an attribute in a certain position in the packet to 1 or 2 operands (an operand may be a complex object such as a regular expression) in a relational or membership test. For example, 10<$1<20 is a test to examine whether the data value in the first attribute position denoted by $1 is greater than 10 and less than 20 (the definition of a predicate can be simplified by limiting the test to involve only 1 operand, e.g., a 2-sided range test can be broken into a conjunction of two one-sided tests). The subscriber submits a collection of these tests in one or a plurality of subscriptions, each of which may include the subject field of the subscriber's interest.

The embodiments described herein concern content-based routing using filters, which are objects derived from subscriptions and differ from subscriptions only in their representations. One example of filter is the conjunctive filter described below. In a sense, a subscription is the original filter, one that is specified, used for filtering packets and/or sent to the network directly by the subscribers. To facilitate propagation and packet matching at the routers in the network, subscriptions may be converted into objects of other formats called filters. For example, in some implementations, each subject is implemented using a multicast network. Filters that are of the same subject and injected to each node of a multicast network for a particular subject will filter packets only with the same subject field, in effect performing subject field filtering implicitly. Filters can therefore be stored under their subject headings at every node in this network without their subject fields. Filters without subject fields are often known as attribute filters. For the following discussion, the terms subscription, filter and attribute filter may be used interchangeably and its meaning made clear only by their context.

To facilitate the matching of the incoming data packets with these subscriptions, each subscription can be processed and broken down by the proxy into its equivalent Disjunctive Normal Form (DNF), as described above, before being sent to the edge router. A DNF is a disjunction of one or more sub-filters called conjunctive filters. Each conjunctive filter is a conjunction of one or more attribute tests, with each attribute expressed at most once in the expression with the same test operator. For instance, a conjunctive filter may constrain matching of the attribute in position 1 with the expression (attributes other than $1 are included in the following example): $1>10 and $1<20 and $2<4 and $3==5 and . . .

As far as routers are concerned, attribute filters are all conjunctive filters because of the proxy action. Not only do conjunctive filters have the advantageous property of a uniform format, which facilitates the propagation of these filters in the core of the network, the single occurrence of each attribute in the filter expression also permits the interpretation of these filters as multi-dimensional geometrical objects, which is useful for describing the embodiment of CBR herein. Hence, in the following, only conjunctive filters are used as examples.

Despite the use of DNF, the benefits of the downstream bandwidth gain obtained by using CBR may be easily out-weighed by the huge amount of computation required if a naive method is used to match a large collection of filters one by one and predicate by predicate. This huge amount of computation in the critical data-forwarding path can be a severe drag on publish-subscribe network efficiency. The embodiment of CBR described herein seeks to reduce this huge amount of computation and to move the majority of computations out of the critical data-forwarding path.

Indeed, the embodiment described herein provides a very efficient method for CBR by approximating filter expressions into more compact forms and pre-computing the filter coverage information off-line. In this CBR method, the filter coverage over every single point in the attribute space is predetermined off-line when filters are inserted or removed. The correct action on the packets with attribute values falling on that point will be the union of the actions predicated by all the filters covering that point. These actions may involve the packet, including for example, packet forwarding to a physical or an encapsulated interface, packet diversion to a user-level process, or packet piping to a parallel machine (e.g., cache, backup router, etc.). Some actions may not involve the packet at all, including for example, triggering a general application running on the router to respond to the arrival of a specially designated packet, prolonging the lifetimes of some filters because there are still active publications in the relevant area of the filters, automatically injecting new filters based on the content of the publications, etc. In practice, the actions predicated by each filter can be embodied by a data structure, such as an action bit mask (ABM) with each bit position representing a distinct (forwarding) action, or a list of distinct actions (Distinct Action List—DAL) when the number of actions becomes too unwieldy to be placed in a bit mask (e.g., an edge router connecting a huge number of subscribers). In the following discussion, when ABM or DAL is mentioned alone, it should be understood that the context covers all forms of action-embodying data structure.

The pre-computation thus generates a CBR map from a number of coordinates in the attribute space to the same number of unions or lists of actions. As this simple map is similar to the Multicast Routing Table used in subject group multicast, it can be known as the CBR Table. As can be seen, by shifting the heavy computational load from the critical data-forwarding path to the non-critical filter pre-computation processes running in the background, data can pass very quickly through the critical data-forwarding path almost free of the processing required for matching the original filter expressions.

This CBR method also preferably includes approximating the filter expressions to more compact forms, for example by means of spatial quantization and predicate reduction. Because there are a huge number of coordinates in each attribute dimension, the attribute space must be quantized, forming a grid. Only the quantized regions instead of individual coordinates are used to construct the CBR table. Because spatial quantization has the effect of grouping individual points in the real attribute space into a single point in the quantized attribute space, every point in the original real attribute space is still indirectly accounted for in the CBR table, sharing with its neighboring points with the same quantized coordinates the list of actions predicated for those quantized coordinates.

Various spatial quantization schemes are allowed in this method. In addition, when a filter expression contains too many predicates, it may be approximated to only the subset(s) represented in the CBR table(s).

The attribute space for an attribute is potentially infinite. Consequently, even with the grid, the attribute space may be too unwieldly. Therefore, the method of CBR described herein preferably reduces the area of the attribute space that is quantized. Specifically, preferably only that area of the attribute space for which matching data packets are expected to be received is quantized. As described below, this area for which matching data will possibly be received is determined based on information received from publishers and/or on a statistical analysis of past (i.e., previously received) packet and/or filter distribution. For example, if a publisher provides information that matching data packets for above a certain value of an attribute will never be published, the attribute space above that certain value preferably is not quantized. Likewise, if statistical analysis shows that filters for below a certain value of an attribute have never been received, the attribute space below that certain value preferably is not quantized.

FIG. 21A illustrates a method 480 of CBR by approximating filter expressions into more compact forms and pre-computing the filter coverage information off-line, according to the embodiment described herein. This method of CBR minimizes real time predicate-by-predicate filter matching. Method 480 can be executed by processor 93 under software control in intelligent router 92 or in the corresponding functions contained in ASIC 91. Typically, because the pre-computation step, which involves filter management functions, is computationally intensive, it is preferably done in software. However, in some filter representations such as the radix representation, it is also possible to maintain the filters in hardware. Method 480 can be implemented, for example, in software modules, e.g., as represented by agent 106 for execution by processor 114 in user machine 100.

As shown in FIG. 21A, the method 480 first determines whether it is time to perform spatial (re-)quantization (step 482), which can be triggered by a periodic or aperiodic time-out, or by a pre-defined event such as the observation that the packet statistics has become overly uneven across the current quantized attribute space. Spatial quantization is performed off-line if needed and when the router is relatively idle (step 484). Spatial quantizing involves the computation of a new grid that will preferably have the property of rendering either the packet distribution or the filter distribution (or some correlation of the two) uniform across the resulting quantized attribute space. Other methods and criteria for spatial quantization can be used.

The grid area may be constructed to only cover a reduced area of the attribute space in which matching packets are expected to be received. For example, if the first attribute $1 represents the number of stocks in a certain industrial sector in the US, the spatial quantization needs only take place in the range from 0 to a number comparable to the total number of stocks in all the US stock exchanges combined. After the statistical distribution of this attribute can be formed from the packet statistics collected, adaptive quantization, as discussed below, can be used to dynamically adjust this range, initially to a much smaller number that is the maximum of the number of stocks for all sectors, and in the future to higher numbers when the maximum grows.

The router then determines if any filters have been inserted at or removed from (step 486) the network location (e.g., a core or edge intelligent router 92, or a publisher machine 100) at which the method 480 is being executed. A reference-count method can keep track of whether a newly injected filter has the identical information (e.g., attributes, matching attribute values, and filter actions) as another filter previously injected (step 488, step 494). Only distinct filters need to be processed. For the purposes of this description, the location is assumed to be an intelligent router 92. For example, a new filter may have been propagated upstream to the intelligent router 92 or an old filter may have timed-out due to an expiration time-out set for the old filter.

When a request to insert or remove a filter is received (step 486), the filter is first compared to the other filters already received and stored by the router using its real coordinates, for the purpose of (1) updating the reference count for the correct filter in the real attribute space (step 488), and (2) determining if the filter to be inserted/removed is a distinct filter or a filter already received before (step 490). If the filter is not a distinct filter, the execution flow will be passed back to the packet matching routine. Otherwise, the attribute values of the packet are mapped to the quantized space to obtain the quantized coordinates of the attribute values (step 492). A similar filter identification procedure is performed, this time using the quantized coordinates, for (1) updating the reference count for the correct filter in the quantized attribute space (step 494), and (2) determining if this filter is a distinct filter in the filter's quantized coordinates (step 496). For step 488 and step 494, two maps of filter coordinates to filter references may preferably be used.

If the filter is distinct in both the real attribute space and the quantized space, the filter can then be approximated and reduced (step 498). For example, only a sub-set of the attributes of a filter with too many predicates may be selected for quantization and mapping. Likewise, attributes with predicates of a more complicated nature (e.g., predicates requiring string matching, regular expression, in-string, in-array, range operators, etc.) or requiring a higher resolution may be handled separately.

One of the key contributions of embodiments of the present invention is the idea that if filters are made compact, packet matching and forwarding can then be performed efficiently in a scalable fashion. The compacting of filters may involve both the mapping of filters to a quantized attribute space (step 492) and the approximation and reduction of the filter expressions (e.g., step 498). As shown, the compacting step includes spatially quantizing the attribute space (step 484). This step forms a grid in the attribute space, as described above and shown below:

The CBR table can now be updated (step 500). Each filter is associated with a rule indicating one or more (routing) actions for publications matching that filter. The (routing) actions predicated by the filter are inserted into the grid cells in this CBR table in the following manner. Using the grid formed in the attribute space of the filter coverage information, step 500 first identifies all the grid cells (i.e., quantized regions) that the quantized coordinates of the filter cover or overlap. Then step 500 inserts into these grid cells the predicated (routing) actions. For example, assuming five possible destination nodes, two filters requiring routing to user machines connected to nodes 2 and 3, respectively may cover the grid cell or quantized region X (see above). As a result, step 500 inserts or affirms the rules respectively requiring routing to nodes 2 and 3 to grid cell or quantized region X. This process is iterated for each of the grid cells identified to be covered or overlapped by the quantized coordinates of the filter. Preferably, step 500 represents the mapping by generating or updating an ABM for each grid cell or quantized region. In this example, the ABM for grid cell or quantized region X, assuming the nodes are numbered 0-4, is:

0 0 1 1 0

Note, bookkeeping is preferably performed for filter removal. For example, suppose a grid cell is covered by two filters, and one of the filters is removed. The corresponding bit in the ABM should not be reset to 0. The confusion can be avoided by bookkeeping for each grid cell the reference count of the filters covering the cell area. The FBM is then generated from the updated reference counters. These reference counters may be referred to as the action reference counters. Therefore, the mapping step 500 may include a bookkeeping step as described herein.

A CBR table is constructed/updated (step 500) from the ABMs generated for each grid cell or quantized region. This preferably involves, directly or indirectly, both spatial requantization and CBR table updating, and all the supplementary steps 482-500. Steps 482-500 are preferably executed off-line (i.e., when the intelligent router 92 is not receiving published packets) or in the background of the real-time routing process as filters are injected, suspended, paused, or removed. Accordingly, if no published packets are received, or if steps 482-500 are being executed in the background, method 480 again determines first if it is time to re-quantize the attribute space (step 482) and subsequently if any filters have been inserted or removed (step 486). The CBR table is then used in the real-time routing process in the data-forwarding path, as shown in FIG. 21B.

The size of the CBR table can be massive for a large number of attributes or a large number of grid divisions for each attribute. In principle, only those grid cells in the CBR table that contain action rules (i.e., those which are covered by filters), need to be stored. The CBR table can be condensed using any technique.

Whereas FIG. 21A illustrates the CBR management aspects of method 480, FIG. 21B illustrates the CBR data forwarding aspects of method 480. If method 480 determines that published packets are received (step 502), the intelligent router 92 receives the published packets (step 504), as seen in FIG. 21B. The received packets can be injected into the network using a point-to-point connection (e.g., wireless connection to an edge router). The received packets are mapped to the grid(s) (step 506). Step 506 determines the quantized coordinates of the packet so that the correct grid cell of the CBR table can be looked up and the action rules contained in that grid cell can be extracted and used to handle the packet (508). These actions may include determining which nodes or other locations in the network to route the packet, or dropping the packet.

Leakage Reduction

The CBR method 480 presented so far may incur error in the form of packet leakage as a result of filter approximation (see step 492). Because the boundaries of the grid cells, instead of the original filter boundaries, are used for matching packets, the actual regions (e.g., area in 2 dimensions and volume in 3 dimensions) used for matching are enlarged, and unwanted packets whose attribute values fall between the actual filter boundary and the grid cell boundary, herein known as the relaxation region, will erroneously be accepted. As described above, the reduced filter resolution is deemed an acceptable sacrifice when speed performance and scalability are acquired or improved in the process and when the leakage error is small in comparison with the total number of incoming packets.

However, the leakage error in some cases may not be small. For example, when the system contains filters with at least one of its CBR-enabled attribute predicates being an equality or inequality test (e.g., $1=4 & $2=100 & $3<30, or $1=4 & $2>3). In the dimensions of those attributes that are equality-tested or inequality-tested, the filter resembles a point. When the grid boundaries are imposed to subsume these points (in step 490 above), the expanse (e.g., area, volume, hyper-volume) of the relaxation region can be much larger than that of the actual filter itself.

This problem is described in the diagram below, depicting a 2-attribute space and showing two point filters F1 and F2, both defined by an equality test in either dimension. The numerals indicate the grid cell coordinates and the alphabets the real coordinates. Those packets whose attributes fall into anywhere in grid cell (4, 1) will be accepted as matching both F1 and F2.

Such an undesirable property of the CBR method 480 can be mitigated by various techniques that may be performed in the leakage reduction step 516, one of which is described below as an example.

One such technique for leakage reduction 516 involves exact matching in one dimension (1D). Matching packets to filters exactly for all the attributes at the same time is a multi-dimensional problem that does not have a scalable solution. Exact matching in 1D is however known to have many efficient and scalable solutions, including but not limited to: (1) a binary search on an array of filter boundaries; (2) a binary tree search through all the filter boundaries; (3) a radix search down a tree embedded with the filter boundary information; and, (4) a search with other more complicated data structures such as a the interval binary search tree, etc.

In the leakage reduction step 516, 1D exact matching using any 1D search technique is preferably conducted for all the attributes. An exemplary leakage reduction step 516 according to 1D exact matching is described below:

-   -   a. Perform CBR matching step 508 without leakage reduction, as         described above (if there is no match, drop the packet);     -   b. For packets that match (see step 508 above), select one         attribute dimension and match that attribute value of the packet         with the projection of all the filter boundaries on that         attribute axis, using any 1D exact matching technique and its         corresponding data structure. A list of all the forwarding nodes         for which a matched filter is found is obtained;     -   c. If there is no 1D match, the packet can be dropped because it         is guaranteed that no filter will match the packet on all its         attribute tests;     -   d. If there is a match, pick another attribute dimension and         repeat step b until (i) a mismatch is found in any         dimension; (ii) the lists of forwarding nodes produced by all         the previously performed 1D searches do not contain common         interfaces (i.e., the 1D matches are generated from filters from         different interfaces); or, (iii) the exact matching test is done         for all the attribute dimensions, which may include those         disabled for CBR;     -   e. If any one of the dropping condition described in step d does         not happen, and all the attributes are tested without a         mismatch, a decision not to drop the packet can be made.     -   f. In cases where more than one interface is involved, the         interfaces for which the packet is not dropped must be compared         with the list of interfaces obtained from step a. The packet         will only be routed to the interfaces in the intersection         between the two lists will be routed.

Other orders of substeps a-f are allowed. For example, sub-step a may be performed after the 1D leakage reduction step (sub-steps b-e) is completed. Some sub-steps may be integrated.

It is noted that the above 1D leakage reduction step 516 is not exact when all the dimensions are taken into account. Using the last example, a packet having attribute values $1=a & $2=d will pass the exact-matching test in either dimension, but the test in each dimension actually matches a different filter. In a true multi-dimensional analysis, the packet would have been dropped. This leakage reduction is therefore only good for dropping packets and not for accepting packets. For the latter cause, it is only approximate and leakage error is still possible. Notwithstanding its inaccuracy, the leakage reduction step 516 greatly reduces the leakage error caused by using the entire area in grid cell (4, 1) for filtering.

The data-forwarding path traffic through the intelligent router 92, at which method 480 is performed, is checked to determine if it is above a set threshold (step 510) (i.e., the intelligent router 92 is “busy,” e.g., being occupied with the critical task of forwarding packets). If the intelligent router 92 is busy, the packets that map to covered grid cells are routed (step 508) based on the routing actions determined by step 508 (step 512), and the corresponding packet statistics is updated (step 514). Consequently, if the intelligent router 92 is busy, “leakage” resulting from routing packets that map to a partially covered grid cell, but that fall outside the actual filter coverage in that grid cell, is accepted as a sacrifice to improve routing speed.

If step 510 determines that the intelligent router 92 is not busy (i.e., the traffic is not above the threshold), leakage reduction is preferably performed (step 503). The leakage reduction step 516 reduces the leakage described in the preceding paragraph. The leakage reduction may be performed, for example, according to the below-described methods.

Up to this point, no exact or predicate-by-predicate filter matching has been performed in real time. However, a minimal level of exact filter matching may be allowed in method 480, preferably only if the traffic is not above threshold. This CBR method intrinsically groups filters according to their locations with respect to the grid. The grid cells are a tool to group filters according to their geometrical locations. Within any group of filters (alternatively known as filter bucket), detailed filtering at more accuracy can take place for some situations. Such extra matching requirements can be stored in the filter bucket. Some examples include:

-   -   1. Attribute tests requiring a higher resolution than provided         by the CBR map can be processed after the filter bucket is         retrieved from the first grid-matching step of CBR (step 508).     -   2. Attributes tests of more complicated nature (e.g., string         matching, regular expression, in-string, in-array, range         operators, etc.) are handled by the filter bucketing method.     -   3. For filters containing a large number of attribute tests, the         attributes can be separated into two groups, one group entered         into the CBR map and another group in the filter bucket.         The filter predicates for the attributes described in 1-3, may         be reduced by step 498 above. Additionally, if the intelligent         router 92 is not busy (see step 520), a predicate-by-predicate         or other exact filter matching is used to match such packets to         the filter bucket determined by the partially covered grid         cells, as ascertained from the CBR table. Since the filter         bucket for that grid cell or quantized region is already reduced         (from the total number of filters) by the pre-computation (in         steps 482-500), this process is still more efficient that simply         doing straight predicate-by-predicate CBR.

Before routing the packets based on the CBR table (step 512) (as determined by step 508), the method determines if there are any reduced filter predicates or packets mapped to partially covered grid cells (step 522) for the filter bucket determined by the mapped-to grid cell. If there are such reduced filter predicates (e.g., from examples 1-3 above) or such mapped packets, predicate-by-predicate or other exact filter matching is performed (step 524). The matched packets are then routed based on the routing actions determined from the CBR table and the exact matching, for example, by intersecting the interface lists obtained by the two methods (step 512) and the packet statistics is updated (514).

In alternative embodiments of the method 480, the traffic threshold checking step 510 may precede only some of the computationally intensive steps, such as steps 518 and 524, as determined by a balancing of waste versus computational intensity. Further, the method 480 may have separate paths for packets that map to completely covered grid cells and for packets that map to partially covered grid cells. The traffic threshold step 510 may then be only performed in the partially covered grid cell path.

The leakage reduction step 516 in method 480 may be replaced with a more advanced leakage reduction procedure, described herein. The advanced leakage reduction procedure further reduces leakage error. For example, exact multi-dimensional matching can be performed within the grid cell by cross-producting after the grid table search. Cross-producting involves the following procedure:

-   -   a. Perform 1D exact-matching as described above, using any 1D         exact-matching technique. The main difference in this         alternative step is that a list of filter labels instead of a         list of forwarding nodes is produced;     -   b. If the list is empty (i.e., no matches), the packet is         dropped;     -   c. If there is at least one match, the search proceeds to         another attribute. Step ac are repeated until any one of the         short-circuiting conditions below is met: (i) a mismatch is         found in any dimension; (ii) there is no common filter label in         all the filter label lists produced by the previous 1D tests;         or, (iii) all the dimensions have been tested; and     -   d. If any one of the dropping condition described in step c does         not happen, and all the attributes are tested without a         mismatch, a decision to accept the packet can be made.

For example, in the above diagram, a packet having attribute values (a, d) will produce F2 for the $1 test and F1 for the $2 test. Since there is no intersection between the two filter label lists, the packet will be dropped. On the other hand, a packet having attribute values (a, c) will produce F2 in both the $1 and the $2 tests, causing the packet to be accepted. Since this procedure is almost exact even in the final multi-dimensional analysis, it is a test to accept packets and not merely one to drop them. The only approximation that has been made is the truncation of attribute tests in the filters. This problem is not unsolvable. It can for example be circumvented by the following procedure:

-   -   1. Create multiple grid tables involving subsets of attributes         corresponding to a subset permutation of the full set (e.g.,         choose ($1, $2, $3) as one set, ($2, $4, $5) as the other). A         filter with a long list of predicates will be covered by at         least one such grid table; or     -   2. Perform the cross-producting test for all the attributes. The         probability of short-circuiting is very high because filters         with a large number of predicates are selective in nature, and         any one of the packet dropping conditions (e.g., filter label         list intersection) outlined in step c above could occur before         all the attributes are tested.

Since it is impractical and rare to have a filter containing a large number of predicates, some truncation of the filter expression, though necessary, may occur infrequently.

This hybridized procedure combining spatial quantization and cross-producting and the multi-table lookup approach as described above constitute another key contribution of this patent, in that both methods combined solve the traditional problem of non-scalability often faced by any cross-producting solution, as seen below.

In the case of point filters, the cross-producting solution is exact. In the case of range filters, however, there are traditionally two problems with cross-producting as a list of filter labels need to be stored between any pair of neighboring filter boundaries. First, the storage is of order N², where N is the number of filters, when the system is injected with range filters that highly overlap each other. Secondly, the list-intersection step is of order N, which can be a very slow process when N is large. The hybridized approach combining the grid search and the cross-producting method reduces both problems to a reasonable size because only those filter boundaries that fall into the same grid cells need to be stored and matched for packets falling into the boundaries of that grid cell. In a way, the grid cells have taken over the role of storing filter label lists from the intervals between neighboring filter boundaries, and since there are fewer grid cells, filter label lists need to be stored.

If the grid is constructed based on the filter boundary distribution, an even number of filters will result in each grid cell interval in any attribute dimension. The storage problem N² becomes less formidable when N becomes small. For example, a grid of 32 intervals would have reduced the storage problem by (N/32)²*32N/32. The problem of list-intersection speed is similarly alleviated.

The cross-producting method as described above works as long as the number of grid cells remain practically a small number. The method of dividing attributes into various permutation sets and assigning one CBR tables for each set limits the number of grid cells in each table to a reasonable number. For example, if L is the number of divisions in each attribute axis, the total number of grid cells for k number of attributes would be L^(k). By using the multiple-table (size=4) method, the size is now reduced to M L⁴, where M is smaller than the total number of permutations k!/(k−4)!4!. It is noted that some permutations highly overlap one another and only one can be chosen as a representative. (e.g., {$1, $2, $3}, {$1, $2, $4}, {$1, $2, $5}).

A CBR method according to the present embodiment (e.g., method 480) (minus the exact predicate-by-predicate filter matching steps 516 and 524) has at least the following properties: 1) the packet forwarding speed is very fast and comparable to IP routing, requiring only O[k log(L)] steps, where L is the number of divisions in any attribute axis and k the number of attributes being quantized and mapped. With 4 attributes and 32 divisions per attribute, about 22 steps are required; 2) the packet forwarding speed is a constant in real time. It is not dependent on the number of filters (N). This property makes it possible to estimate the maximum bandwidth capacity sustainable by this CBR method; 3) it is fast for dynamic updating as well. For example, insertion of a filter may take O(L^(k)) steps, depending on the implementation; 4) the storage requirement is small and limited, being approximately k(L−1)S_(A)+N_(r)L^(k)/8, where S_(A) is the size of the attribute data type in bytes and N_(r) the number of forwarding interface at the router. The first term is the total size of all k number of the indexing components of the data structure and the latter the actual forwarding component (i.e., the CBR table) being indexed. For a router with 8 interfaces configured with a 4-integer-attribute 32-division CBR, the amount of storage is only 1 MB; 5) the indexing data structure, being separated from the much larger forwarding component, is very amenable to caching. For example, using the example above, the size of the indexing structure is only (4)(31)(4)=496 bytes; and, 6) the grid is also a tool for grouping and organizing filters. It is useful in particular for merging filters before they are propagated, making this method very scalable in systems comprising a lot of subscribers. In summary, the CBR method 480 is fast, predictable, dynamic, scalable, not memory demanding, flexible, and hence practical for deployment in the core of a publish-subscribe network.

Adaptive Grid

As described above, the grid is formed by spatially quantizing the attribute space. Generally speaking, the attribute space is uniformly quantized. However, if the attribute space is adaptively spatially quantized, e.g., based on past packet distribution, the resolution of the grid, and therefore, the efficiency of the CBR method 480 can be improved. Adaptive quantizing determines region(s) of the attribute space for which the most matching packets are likely to be received. For example, adaptive quantizing may determine the region(s) of the attribute space in which the past packet distribution is most concentrated. The determined region or regions are then quantized to a greater degree than the other quantized regions of the attribute space. In other words, in the determined regions, the number of grid cells will be greater and the size of the grid cells will be smaller than in the other quatized regions of the attribute space. The 2 diagrams below of an adaptive grid illustrate this:

In the first diagram, a finer grid is superimposed on the regions of heavy packet traffic. In the second diagram, illustrating an alternative method, the grid spacing is changed on either attribute axis so that more grid cells will be finer and more concentrated in the area encompassed for example by quantized coordinates (3, 2), (4, 2), (3, 3) and (4, 3).

The advantages of such an adaptive grid are numerous. As can be seen in this diagram, the region Z has been adaptively quantized. In the region Z, where there would be four (4) grid cells without adaptive quantizing, there are now sixty-four (64) grid cells. As illustrated in this diagram, whereas the filter coverage information sS previously would have partially covered three grid cells, with the adaptive grid there is only one (1) partially covered grid cell Y. Consequently, the amount of potential leakage is significantly reduced. Further, if one or more of the sixty-four grid cells in the region Z were to be partially covered, the amount of potential leakage in each of these grid cells would be significantly less than in the partially covered grid cell Y. This is because the relaxation region in each of such partially covered grid cells in the region Z would be significantly smaller than the relaxation region in the partially covered grid cell Y Therefore, the efficiency of the CBR method 480 can be improved by using an adaptive grid.

The second method has the advantage of not increasing the storage demand as the first method does because the same number of grid cells is generated. However, it also provides less accuracy as the former method.

While the present invention has been described in connection with an exemplary embodiment, it will be understood that many modifications will be readily apparent to those skilled in the art, and this application is intended to cover any adaptations or variations thereof. For example, various types of publisher machines, user or subscriber machines, channels and configurations of them, and hardware and software implementations of the content-based routing and other functions may be used without departing from the scope of the invention. This invention should be limited only by the claims and equivalents thereof. 

1. A method for content-based routing of packets in a publish-subscribe network including an intelligent router, the method comprising: receiving a packet at said intelligent router in the network; said intelligent router accessing a map specifying filter coverage in an attribute space; said intelligent router inspecting content of the packet for use in a routing decision for the packet; using the map to assist in said intelligent router's routing decision for the packet; said intelligent router making a routing decision based upon the inspected content of the packet and the map; routing, by said intelligent router, the packet based upon the routing decision; and computing filter coverage; wherein computing filter coverage includes spatially quantizing attribute space into a grid comprising grid cells.
 2. The method of claim 1, wherein the making a routing decision step further includes matching the content to a corresponding description.
 3. The method of claim 2, wherein the matching step includes using a plurality of conjunctive filters in order to identify a match.
 4. The method of claim 2, wherein the matching step includes performing attribute tests.
 5. The method of claim 1, wherein the making a routing decision step includes using the map online.
 6. The method of claim 1, further comprising precomputing filter coverage off-line or with background processing.
 7. The method of claim 1, further comprising precomputing filter coverage wherein the precomputing step includes approximating and reducing filter expressions.
 8. The method of claim 1, wherein the computing filter coverage includes: combining filter coverage information and the grid; and generating the map based on a union of actions predicated by filter coverage information in each grid cell.
 9. A router for content-based routing of packets in a publish-subscribe network, comprising modules for executing the method recited in claim
 1. 10. A network comprising a plurality of routers according to claim
 9. 11. A computer-readable medium comprising instructions for performing the method recited in claim
 1. 12. A method for use in content-based routing of packets on a network including an intelligent router, the method comprising: (a) said intelligent router spatially quantizing attribute space, wherein the spatially quantizing step creates a grid including grid cells; (b) said intelligent router identifying the grid cells covered by a plurality of filters, wherein each filter has at least one predicated attribute; and (c) said intelligent router updating a content-based routing (CBR) table with action rules predicated by the plurality of filters that cover the grid cells identified in step (b).
 13. The method of claim 12, further comprising the step of: determining if one or more distinct filters are inserted or removed from a node; and executing steps (b) and (c) at the node based on a determination that one or more distinct filters are inserted or removed from the node.
 14. The method of claim 12, further comprising the steps of: receiving published packets; and plotting the received packets to the grid.
 15. The method of claim 14, wherein for packets plotted to grid cells that are completely covered by the computed filter coverage information, the method further comprises: checking the CBR table to determine routing actions for packets plotted to the completely covered grid cells.
 16. The method of claim 15, further comprising: determining if the network traffic is above a set threshold; and, routing the published packets based on the determined routing actions, if the network traffic is determined to be above the set threshold.
 17. The method of claim 16, further comprising: performing leakage reduction, if the network traffic is determined to be at or below the set threshold.
 18. The method of claim 17, wherein the performing leakage reduction step includes one-dimension exact matching.
 19. The method of claim 17, wherein the performing leakage reduction step includes cross-producting.
 20. The method of claim 17, wherein the performing leakage reduction step includes the formation of multiple grids and CBR tables according to the full set of subset of the permutations of a limited number and a variety of attributes.
 21. The method of claim 16, further comprising: determining if there are any reduced filter predicates or packets plotted to partially covered grid cells, if the network traffic is determined to be at or below the set threshold; performing predicate-by-predicate filter matching to determine routing actions for any reduced filter predicates and any packets plotted to partially covered grid cells, if there are determined to be reduced filter predicates or packets plotted to partially covered grid cells; and, routing the packets based on determined routing actions.
 22. The method of claim 12, further comprising reducing filter expressions.
 23. The method of claim 12, wherein step (a) includes adaptive quantizing the attribute space.
 24. The method of claim 23, wherein the adaptive quantizing step adaptively quantizes the attribute space based on packet distribution information.
 25. The method of claim 12, wherein the spatially quantizing step spatially quantizes the attribute space based on packet distribution information.
 26. The method of claim 12, wherein the spatially quantizing step updates the grid based on packet distribution information.
 27. The method of claim 12, wherein step (c) generates or updates an action bit mask for a grid cell that is covered by the computer filter coverage information.
 28. The method of claim 12, wherein step (c) generates or updates a linked list of action for a grid cell that is covered by the computer filter coverage information.
 29. The method of claim 12, further comprising updating parameters for covered cells in the CBR table, wherein the parameters include statistical information about the filter distribution.
 30. The method of claim 12, further comprising collecting statistical information about packet distribution, wherein the packet distribution information is used in step (a).
 31. The method of claim 12, wherein steps (a) through (c) are performed offline.
 32. The method of claim 12, further comprising performing content based routing (CBR), wherein only the CBR table and the rules in the CBR table are used to perform the CBR.
 33. A computer-readable medium comprising instructions for performing the method recited in claim
 12. 